Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon
نویسندگان
چکیده
In this paper we resolve the following problem: Given a simple polygon , what is the maximum-area polygon that is axially symmetric and is contained by ? We propose an algorithm for answering this question, analyze the algorithm’s complexity, and describe our implementation of it (for convex polygons). The algorithm is based on building and investigating a planar map, each cell of which corresponds to a different configuration of the inscribed polygon. We prove that the complexity of the map is , where is the complexity of . For a convex polygon the complexity, in the worst case, is .
منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملMaximizing the area of an axially symmetric polygon inscribed in a simple polygon
In this paper we solve the following optimization problem: Given a simple polygon P , what is the maximum-area polygon that is axially symmetric and is contained by P? We propose an algorithm for solving this problem, analyze its complexity, and describe our implementation of it (for the case of a convex polygon). The algorithm is based on building and investigating a planar map, each cell of w...
متن کاملA linear-time algorithm for the maximum-area inscribed triangle in a convex polygon
Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently been shown to be incorrect by Keikha, Löffler, Urhausen, and van der Hoog. These authors give an alternative algorithm with O(n log n) time complexity. Here...
متن کاملMaximum-Area Triangle in a Convex Polygon, Revisited
We revisit the following problem: Given a convex polygon P , find the largest-area inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by Dobkin and Snyder [1] for solving this problem fails. We then proceed to show that with a small adaptation, their approach does lead to a quadratic-time algorithm. We also present a more involved O(n logn) time divide-and-c...
متن کاملLargest inscribed rectangles in convex polygons
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a randomized algorithm that computes an inscribed rectangle with area at least (1− ) times the optimum with probability t in time O( 1 log n) for any constant t < 1. We further give a dete...
متن کامل